Abstract. This paper describes a new static analysis for finding approximations to the path-length of variables in imperative, object-oriented programs. The path-length of a variable v is the cardinality of the longest chain of pointers that can be followed from v. It is shown how such information may be used for automatic termination inference of programs dealing with dynamically created data-structures

Etienne Payet

Fausto Spoto